Accelerating Nonnegative Matrix Factorization Algorithms Using Extrapolation

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nonnegative Matrix Factorization: Algorithms and Parallelization

An alternative to singular value decomposition (SVD) in the information retrieval is the low-rank approximation of an original non-negative matrix A by its non-negative factors U and V . The columns of U are the feature vectors with no non-negative components, and the columns of V store the non-negative weights that serve for the combination of feature vectors. First experiments show that restr...

متن کامل

Using Population Based Algorithms for Initializing Nonnegative Matrix Factorization

The nonnegative matrix factorization (NMF) is a boundconstrained low-rank approximation technique for nonnegative multivariate data. NMF has been studied extensively over the last years, but an important aspect which only has received little attention so far is a proper initialization of the NMF factors in order to achieve a faster error reduction. Since the NMF objective function is usually no...

متن کامل

DSANLS: Accelerating Distributed Nonnegative Matrix Factorization via Sketching Technical Report

Nonnegative matrix factorization (NMF) has been successfully applied in di erent elds, such as text mining, image processing, and video analysis. NMF is the problem of determining two nonnegative low rank matrices U and V , for a given input matrix M , such that M ≈ UV >. There is an increasing interest in parallel and distributed NMF algorithms, due to the high cost of centralized NMF on large...

متن کامل

Accelerating the Lee-Seung Algorithm for Nonnegative Matrix Factorization

Approximate nonnegative matrix factorization is an emerging technique with a wide spectrum of potential applications in data analysis. Currently, the most-used algorithms for this problem are those proposed by Lee and Seung [7]. In this paper we present a variation of one of the Lee-Seung algorithms with a notably improved performance. We also show that algorithms of this type do not necessaril...

متن کامل

Document clustering using nonnegative matrix factorization

Amethodology for automatically identifying and clustering semantic features or topics in a heterogeneous text collection is presented. Textual data is encoded using a low rank nonnegative matrix factorization algorithm to retain natural data nonnegativity, thereby eliminating the need to use subtractive basis vector and encoding calculations present in other techniques such as principal compone...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Neural Computation

سال: 2019

ISSN: 0899-7667,1530-888X

DOI: 10.1162/neco_a_01157